Looking Algebraically at Tractable Quantified Boolean Formulas
نویسندگان
چکیده
We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We present a pair of results: the first is a new and simple algebraic proof of the tractability of quantified 2-satisfiability; the second is a purely algebraic characterization of models for quantified Horn formulas that were given by Büning, Subramani, and Zhao, and described proof-theoretically.
منابع مشابه
Bounded-width QBF is PSPACE-complete
Tree-width is a well-studied parameter of structures that measures their similarity to a tree. Many important NP-complete problems, such as Boolean satisfiability (SAT), are tractable on bounded tree-width instances. In this paper we focus on the canonical PSPACE-complete problem QBF, the fully-quantified version of SAT. It was shown by Pan and Vardi that this problem is PSPACE-complete even fo...
متن کاملTreewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
Theoretical studies show that in some combinatorial problems, there is a close relationship between classes of tractable instances and the treewidth (tw) of graphs describing their structure. In the case of satisfiability for quantified Boolean formulas (QBFs), tractable classes can be related to a generalization of treewidth, that we call quantified treewidth (twp). In this paper we investigat...
متن کاملAn Alternative Representation for QBF
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused on quantified Boolean formulas in prenex normal form (QBF), we explore an alternative representation of quantified Boolean formulas, called Constrained Quantified Formulas (CQF). CQF allows for a more direct represen...
متن کاملDichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a simple criterion to determine which of the two cases holds. This result is surprising in light of Ladner’s theorem, which implies that there are an infinite...
متن کاملThe long way from CDClL
Current SAT solvers are powerful enough to be used as engines in real applications. Those applications made the success of a special kind of SAT solvers, namely Conflict Driven Clause Learning SAT solvers (CDClL for short), developed initially by Joao Marques Silva with GRASP [8], and popularized by the SAT solver Chaff [9]. Despite SAT being a NP-complete problem in theory, it might look tract...
متن کامل